Random environment on coloured trees
نویسندگان
چکیده
In this paper we study a regular rooted coloured tree with random labels assigned to its edges, where the distribution of the label assigned to an edge depends on the colours of its endpoints. We obtain some new results relevant to this model and also show how our model generalizes many other probabilistic models, including random walk in random environment on trees, recursive distributional equations, and multi-type branching random walk on R.
منابع مشابه
Random walks in random environment on trees and multiplicative chaos 1
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random environment. A related problem, with only one type of vertices and quite stringent conditions on the transition probabilities but on general trees has been conside...
متن کاملRainbow spanning trees in properly coloured complete graphs
In this short note, we study pairwise edge-disjoint rainbow spanning trees in properly edge-coloured complete graphs, where a graph is rainbow if its edges have distinct colours. Brualdi and Hollingsworth conjectured that every Kn properly edge-coloured by n−1 colours has n/2 edge-disjoint rainbow spanning trees. Kaneko, Kano and Suzuki later suggested this should hold for every properly edge-c...
متن کاملOn Generating Series of Coloured Planar Trees
We generalize and reprove an identity of Parker and Loday. It states that certain pairs of generating series associated to coloured plane rooted trees are mutually reciprocal series.
متن کاملCounting planar maps, coloured or uncoloured
We present recent results on the enumeration of q-coloured planar maps, where each monochromatic edge carries a weight ν. This is equivalent to weighting each map by its Tutte polynomial, or to solving the q-state Potts model on random planar maps. The associated generating function, obtained by Olivier Bernardi and the author, is differentially algebraic. That is, it satisfies a (nonlinear) di...
متن کاملBranching random walks in random environment on Cayley graphs
We review some recent results concerning recurrence and transience for branching random walks in random environment on ddimensional lattices and on trees. We obtain some generalizations of these results for the case when the branching random walk in random environment takes place on arbitrary infinite connected Cayley graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007